Statistical Mechanics of Combinatorial Auctions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Statistical mechanics of combinatorial auctions.

Combinatorial auctions are formulated as frustrated lattice gases on sparse random graphs, allowing the determination of the optimal revenue by methods of statistical physics. Transitions between computationally easy and hard regimes are found and interpreted in terms of the geometric structure of the space of solutions. We introduce an iterative algorithm to solve intermediate and large instan...

متن کامل

Statistical mechanics of budget-constrained auctions

Finding the optimal assignment in budget-constrained auctions is a combinatorial optimization problem with many important applications, a notable example being the sale of advertisement space by search engines (in this context the problem is often referred to as the off-line AdWords problem). Based on the cavity method of statistical mechanics, we introduce a message passing algorithm that is c...

متن کامل

Statistical mechanics of combinatorial optimization problems with site disorder.

We study the statistical mechanics of a class of problems whose phase space is the set of permutations of an ensemble of quenched random positions. Specific examples analyzed are the finite-temperature traveling salesman problem on several different domains and various problems in one dimension such as the so-called descent problem. We first motivate our method by analyzing these problems using...

متن کامل

Applications of Statistical Mechanics to Combinatorial Search Problems

The statistical mechanics of combinatorial search problems is described using the example of the well-known NP-complete graph coloring problem. We focus on a recently identified phase transition from underto overconstrained problems, near which are concentrated many hard to solve search problems. Thus, a readily computed measure of problem structure predicts the difficulty of solving the proble...

متن کامل

Combinatorial Considerations on Two Models from Statistical Mechanics

and Acknowledgements v Introduction and Overview 1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 The fully packed loop model . . . . . . . . . . . . . . . . . . . . . . . . . 2 The hard particle model . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Outline of the thesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review Letters

سال: 2006

ISSN: 0031-9007,1079-7114

DOI: 10.1103/physrevlett.97.128701